Approximation algorithms for a sequencing problem with a biased bipartite structure
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Bipartite Multi-cut Problem
We introduce the Bipartite Multi-cut problem. This is a generalization of the st-Min-cut problem, is similar to the Multi-cut problem (except for more stringent requirements) and also turns out to be an immediate generalization of the Min UnCut problem. We prove that this problem is NP-hard and then present LP and SDP based approximation algorithms. While the LP algorithm is based on the Garg-V...
متن کاملImproved Approximation Algorithms for Bipartite Correlation Clustering
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipartite graph, the objective of BCC is to generate a set of vertex-disjoint bi-cliques (clusters) which minimizes the symmetric difference to it. The best known approximation algorithm for BCC due to Amit (2004) guarantee...
متن کاملApproximation Algorithms for a Triangle Enclosure Problem
Given a set S of n points in the plane, we want to find a triangle, with vertices in S, such that the number of points enclosed by it is maximum. An exact solution can be found by considering all ( n 3 ) triples of points in S. We consider the problem of approximating this triangle. We show that, by considering only triangles with at least 1, 2, or 3 vertices on the convex hull of S, we obtain ...
متن کاملApproximation algorithms for a vehicle routing problem
In this paper we investigate a vehicle routing problem motivated by a realworld application in cooperation with the German Automobile Association (ADAC). The general task is to assign service requests to service units and to plan tours for the units such as to minimize the overall cost. The characteristics of this large-scale problem due to the data volume involve strict real-time requirements....
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Mechanical Design, Systems, and Manufacturing
سال: 2016
ISSN: 1881-3054
DOI: 10.1299/jamdsm.2016jamdsm0045